Locating one pairwise interaction: Three recursive constructions
نویسندگان
چکیده
منابع مشابه
Locating one pairwise interaction : Three recursive constructions ∗
In a complex component-based system, choices (levels) for components (factors) may interact to cause faults in the system behaviour. When faults may be caused by interactions among few factors at specific levels, covering arrays provide a combinatorial test suite for discovering the presence of faults. While well studied, covering arrays do not enable one to determine the specific levels of fac...
متن کاملRecursive constructions for triangulations
Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2an 2−o(n2) non-isomorphic face 2-colourable triangulations of Kn and Kn,n,n in orientable and non-orientable surfaces for values of n lying in certain residue classes and for appropriate constants a.
متن کاملRecursive constructions for large caps
We introduce several recursive constructions for caps in projective spaces. These generalize the known constructions in an essential way and lead to new large caps in many cases. Among our results we mention the construction of {(q + 1)(q2 + 3)}−caps in PG(5, q), of {q4 + 2q2}-caps in PG(6, q) and of q2(q2 + 1)2-caps in PG(9, q).
متن کاملRecursive ORAMs with Practical Constructions
We present Recursive Square Root ORAM (R-SQRT), a simple and flexible ORAM that can be instantiated for different client storage requirements. R-SQRT requires significantly less bandwidth than Ring and Partition ORAM, the previous two best practical constructions in their respective classes of ORAM according to client storage requirements. Specifically, R-SQRT is a 4x improvement in amortized b...
متن کاملImproving Two Recursive Constructions for Covering Arrays
Recursive constructions for covering arrays employ small ingredient covering arrays to build large ones. At present the most effective methods are “cut–and–paste” (or Roux-type) and column replacement techniques. Both can introduce substantial duplication of coverage; if unnecessary duplication can be avoided then the recursion can yield a smaller array. Two extensions of covering arrays are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2016
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.17551